منابع مشابه
Tame Flows
The tame flows are “nice” flows on “nice” spaces. The nice (tame) sets are the pfaffian sets introduced by Khovanski, and a flow Φ : R×X → X on pfaffian set X is tame if the graph of Φ is a pfaffian subset of R×X×X . Any compact tame set admits plenty tame flows. We prove that the flow determined by the gradient of a generic real analytic function with respect to a generic real analytic metric ...
متن کاملTame structures
We study various notions of “tameness” for definably complete expansions of ordered fields. We mainly study structures with locally o-minimal open core, d-minimal structures, and dense pairs of d-minimal structures.
متن کاملTame Mappings Are Semismooth
Superlinear convergence of the Newton method for nonsmooth equations requires a “semismoothness” assumption. In this work we prove that locally Lipschitz functions definable in an o-minimal structure (in particular semialgebraic or globally subanalytic functions) are semismooth. Semialgebraic, or more generally, globally subanalytic mappings present the special interest of being γ-order semismo...
متن کاملFlyspeck I: Tame Graphs
We present a verified enumeration of tame graphs as defined in Hales’ proof of the Kepler Conjecture and confirm the completeness of Hales’ list of all tame graphs while reducing it from 5128 to 2771 graphs.
متن کاملTame Plane Graphs
These theories present the verified enumeration of tame plane graphs as defined by Thomas C. Hales in his revised proof of the Kepler Conjecture. Compared with his original proof, the notion of tameness has become simpler, there are many more tame graphs, but much of the earlier verification [1] carries over. For more details see http:// code.google.com/p/flyspeck/ and the forthcoming book “Den...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Banach Center Publications
سال: 1990
ISSN: 0137-6934,1730-6299
DOI: 10.4064/-26-1-233-261